A more accurate second-order polynomial metamodel using a pseudo-random number assignment strategy

نویسنده

  • M. Chih
چکیده

The response surface metamodel is a useful sequential methodology for approximating the relationship between the input variables and the output response in computer simulation. Several strategies have been proposed to increase the accuracy of the estimation of the metamodel. In the current paper, we introduce an effective pseudo-random number (PRN) assignment strategy with Box-Behnken design to construct a more accurate second-order polynomial metamodel to estimate the network reliability of a complex system. The results obtained from the simulation approach show that the reduction in maximum absolute relative error between the response surface approximation and the actual reliability function is 35.63% after the PRN assignment strategy is applied. Journal of the Operational Research Society (2013) 64, 198–207. doi:10.1057/jors.2012.34 Published online 25 April 2012

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Pseudo-Random Number Assignment Strategy for Simulation Experiments

Simulation models are often used to select alternatives to system designs. A model of a simulation model, referred to as ametamodel, can be used to explore the functional relationships between the mean response of a simulation model and a set of simulation input variables. The estimated metamodel is then used to predict the system response for speci ed sets of input variables and to identify th...

متن کامل

Order Statistics for Probabilistic Graphical Models

We consider the problem of computing r-th order statistics, namely finding an assignment having rank r in a probabilistic graphical model. We show that this problem is NP-hard even when the graphical model has no edges (zero-treewidth models) via a reduction from the number partitioning problem. We use this reduction, specifically pseudopolynomial time algorithms for number partitioning, to yie...

متن کامل

Second Order Moment Asymptotic Expansions for a Randomly Stopped and Standardized Sum

This paper establishes the first four moment expansions to the order o(a^−1) of S_{t_{a}}^{prime }/sqrt{t_{a}}, where S_{n}^{prime }=sum_{i=1}^{n}Y_{i} is a simple random walk with E(Yi) = 0, and ta is a stopping time given by t_{a}=inf left{ ngeq 1:n+S_{n}+zeta _{n}>aright}‎ where S_{n}=sum_{i=1}^{n}X_{i} is another simple random walk with E(Xi) = 0, and {zeta _{n},ngeq 1} is a sequence of ran...

متن کامل

Design of cybernetic metamodel of cryptographic algorithms and ranking of its supporting components using ELECTRE III method

Nowadays, achieving desirable and stable security in networks with national and organizational scope and even in sensitive information systems, should be based on a systematic and comprehensive method and should be done step by step. Cryptography is the most important mechanism for securing information. a cryptographic system consists of three main components: cryptographic algorithms, cryptogr...

متن کامل

Dynamic Spectrum Access for Primary Operators Via Carrier Aggregation in LTE-Advanced Environments

In this paper, we address dynamic spectrum access for Primary Operators (POs) for LTEAdvanced systems. We propose a dynamic spectrum access framework that exploits the capabilities of carrier aggregation to efficiently utilize the unutilized spectrum which varies with time and space when static spectrum access policies are adopted. A spectrum owner (SO) adopts an auction scheme for accessing sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JORS

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2013